A bound for condition numbers of matrices

Lower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces

Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. If we used instead of The purpose of this paper is to establish a Hardy type formula for , where is Hausdorff matrix and A similar result is also established for where In particular, we apply o...

Some inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm

Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...

Lower bounds of Copson type for the transpose of matrices on weighted sequence spaces

امید ریاضی نرخ پوشش برای ماتریس‌های هلمن

Hellman’s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm.  After that, all further analyses of researchers are based on this lower bound. In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrice...

Inverse Young inequality in quaternion matrices

Inverse Young inequality asserts that if $nu >1$, then $|zw|ge nu|z|^{frac{1}{nu}}+(1-nu)|w|^{frac{1}{1-nu}}$, for all complex numbers $z$ and $w$, and equality holds if and only if $|z|^{frac{1}{nu}}=|w|^{frac{1}{1-nu}}$. In this paper the complex representation of quaternion matrices is applied to establish the inverse Young inequality for matrices of quaternions. Moreover, a necessary and ...